More Robust Multiparty Protocols with Oblivious Transfer

نویسندگان

  • Jörn Müller-Quade
  • Hideki Imai
چکیده

With oblivious transfer multiparty protocols become possible even in the presence of a faulty majority. But all known protocols can be aborted by just one disruptor. This paper presents more robust solutions for multiparty protocols with oblivious transfer. This additional robustness against disruptors weakens the security of the protocol and the guarantee that the result is correct. We can observe a trade off between robustness against disruption and security and correctness. We give an application to quantum multiparty protocols. These allow the implementation of oblivious transfer and the protocols of this paper relative to temporary assumptions, i.e., the security increases after the termination of the protocol.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Oblivious Transfer Protocols based on White-Box Cryptography

Oblivious transfer protocol is an important cryptographic primitive having numerous applications and particularly playing an essential role in secure multiparty computation protocols. On the other hand existing oblivious transfer protocols are based on computationally expensive public-key operations which remains the main obstacle for employing such protocols in practical applications. In this ...

متن کامل

Two-Round Multiparty Secure Computation Minimizing Public Key Operations

We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) poly(n, λ) invocations of a two-round oblivious transfer protocol (which use expensive public-key operations) and poly(λ, |C|) cheaper one-way function calls, where λ is the security parameter, n is the number of parties, and C is the circuit being computed. All previous...

متن کامل

Black-Box Constructions of Protocols for Secure Computation

In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest majority that use the underlying primitive (e.g., enhanced trapdoor permutation) in a black-box way only. Until now, all known general constructions for this setting were inherently non-blackbox since they required the ...

متن کامل

Two-Round Multiparty Secure Computation from Minimal Assumptions

We provide new two-round multiparty secure computation (MPC) protocols assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest adversaries (in the plain model) then so is our tworound MPC protocol. Similarly, if the assumed two-round OT protocol is secure against malicious adversaries (in the common random...

متن کامل

Oblivious Transfer in the Universally Composable Security Model

A new promising direction in cryptography, started almost twenty years ago, is the field of Secure Multiparty Computation. In this scenario a set of players want to compute some functions on their inputs, but they don’t trust each other so they don’t want to disclose their inputs to each other. The purpose of this thesis is to investigate the Oblivious Transfer primitive, one of the fundamental...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cs.CR/0101020  شماره 

صفحات  -

تاریخ انتشار 2001